Integration of unicast and multicast scheduling in input-queued packet switches
نویسندگان
چکیده
Packet queuing and scheduling, two of the critical components in an input-queued packet switch, have been extensively studied in the context of either pure unicast traffic or pure multicast traffic. Unfortunately, the results from a study in one context are not applicable to the other context. The design of integrated scheduling for both types of traffic remains an open issue. This paper deals with the problem of integrating unicast and multicast scheduling in an N · N input-queued packet switch with first in first out buffers. Instead of using isolated switching fabrics for unicast and multicast traffic respectively, we efficiently utilize one switching fabric for both unicast and multicast traffic by a careful design. In our design, each input port maintains a set of unicast queues based on virtual output queuing technique and a set of multicast queues based on a load-balance policy. By employing the research advances that have already been gained for unicast and multicast scheduling, we propose two practical slot-coupled integration algorithms, lSCIA (a loosely slot-coupled integration algorithm) and fSCIA (a fully slot-coupled integration algorithm). In each time slot, unicast scheduling and multicast scheduling cooperate together and the scheduling priority is allocated to either unicast traffic or multicast traffic according to a certain service ratio. The working interval of service ratio is defined as a set such that the saturation throughput is not less than the output load if the service ratio falls into this set. The upper bound and lower bound for the working interval of service ratio are deduced. A 100% throughput can be achieved with strong theoretical guarantees as long as the service ratio lies in the upper bound of the working interval. Both theoretical analysis and simulation studies suggest that the proposed integrated scheduling algorithms exhibit a promising performance in terms of throughput, delay and packet loss ratio, at different traffic compositions under Bernoulli traffic and bursty traffic. 2005 Published by Elsevier B.V.
منابع مشابه
Integration of Unicast and Multicast Scheduling in Input-Queued Packet Switches with High Scalability
This paper focuses on the scalability problems for high-speed switches, and presents an integrated scheduling algorithm that supports unicast and multicast traffic efficiently in input-queued packet switches. Considering the tradeoff balancing complexity and performance, the proposed integrated algorithm performs without iteration, and reduces the scheduling overhead to O(N) with a two-phase (r...
متن کاملIntegrated Queuing and Scheduling for Unicast and Multicast Traffic in Input-Queued Packet Switches
This paper presents the integrated queuing and scheduling for an N × N input-queued packet switch that efficiently supports both unicast and multicast traffic. Each input port maintains two sets of queues each for unicast and multicast traffic. For unicast traffic, we deploy the wellknown virtual output queuing scheme. For multicast traffic, we propose a novel queuing scheme in which a small nu...
متن کاملScheduling in Input Queued Switches: A Survey
Current technology trends make it feasible to build extrememly high band-width connection networks. Development of high performance and cost-eeective switches is of paramount importance in such networks, and is an area of heavy current research. Two most important components of modern switches are queueing and scheduling. This paper presents a brief survey of unicast and multicast scheduling al...
متن کاملOn the Provision of Integrated Qos Guarantees of Switches * Unicast and Multicast Traffic in Input - Queued
In this paper, we address the problem of providing QoS guarantees for multiple input-queued switching architecture. Stable matching of inputs and outputs is used for scheduling the enqueued packets to be transmitted across the switching fabric. With an in-depth theoretic analysis on the properties of stable matching in the context of a multiple input-queued switch, we propose efficient schemes ...
متن کاملOn the Throughput of Input-Queued Cell-Based Switches with Multicast Traffic
In this paper we discuss the throughput achievable in inputqueued cell-based switches loaded with multicast traffic. The switch architecture is assumed to comprise a synchronous broadcast switching fabric, where fixed-size data units, called cells, can be transferred in one slot from one input to any set of outputs. The switch scheduler must select the time slots for transfers of non-conflictin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Networks
دوره 50 شماره
صفحات -
تاریخ انتشار 2006